Enhancing Gradient Sparsity for Parametrized Motion Estimation
نویسندگان
چکیده
In this paper, we propose a novel motion estimation framework based on the sparsity associated with gradients of the parametrized motion field. Beginning with Shen and Wu’s sparse model for optic flow estimation [15], we show the sparsity of the motion field can be enhanced by increasing the degree of freedom of the parametrized motion model. With such an enhancement, we formulate the motion estimation as an `0 optimization problem. Along with an `1 norm regularization to the instant constancy assumption, this problem is solved by a reweighted `1 optimization approach. Experiments on constant, pure translational, and affine motion models certify that the enhanced sparsity provides improved accuracy for motion estimation.
منابع مشابه
Two-Phase Kernel Estimation for Robust Motion Deblurring
We discuss a few new motion deblurring problems that are significant to kernel estimation and non-blind deconvolution. We found that strong edges do not always profit kernel estimation, but instead under certain circumstance degrade it. This finding leads to a new metric to measure the usefulness of image edges in motion deblurring and a gradient selection process to mitigate their possible adv...
متن کاملMotion Compensated Dynamic Imaging without Explicit Motion Estimation
Purpose – The main focus of this abstract is to recover dynamic MRI data from highly under-sampled measurements. Compressed sensing schemes that exploit sparsity in Fourier and gradient domains have enjoyed a lot of success in breath-held cardiac MRI. However, these schemes often result in un-acceptable spatiotemporal blurring and residual alias artifacts, when applied to free breathing cardiac...
متن کاملDuality based optical flow algorithms with applications University of Copenhagen prize thesis
We consider the popular TV-L1 optical flow formulation, and the so-called duality based algorithm for minimizing the TV-L1 energy. The original formulation is extended to allow for vector valued images, and minimization results are given. In addition we consider di↵erent definitions of total variation regularization, and related formulations of the optical flow problem that may be used with a d...
متن کاملCompressed Sensing MR Image Reconstruction Exploiting TGV and Wavelet Sparsity
Compressed sensing (CS) based methods make it possible to reconstruct magnetic resonance (MR) images from undersampled measurements, which is known as CS-MRI. The reference-driven CS-MRI reconstruction schemes can further decrease the sampling ratio by exploiting the sparsity of the difference image between the target and the reference MR images in pixel domain. Unfortunately existing methods d...
متن کاملBlur-Resilient Tracking Using Group Sparsity
In this paper, a Blur Resilient target Tracking algorithm (BReT) is developed by modeling target appearance with a groupwise sparse approximation over a template set. Since blur templates of different directions are added to the template set to accommodate motion blur, there is a natural group structure among the templates. In order to enforce the solution of the sparse approximation problem to...
متن کامل